Two-size probability-changing cluster algorithm
نویسندگان
چکیده
منابع مشابه
The probability of fixation in populations of changing size.
The rate of adaptive evolution of a population ultimately depends on the rate of incorporation of beneficial mutations. Even beneficial mutations may, however, be lost from a population since mutant individuals may, by chance, fail to reproduce. In this paper, we calculate the probability of fixation of beneficial mutations that occur in populations of changing size. We examine a number of demo...
متن کاملBayesian Inference under Cluster Sampling with Probability Proportional to Size
Cluster sampling is common in survey practice, and the corresponding inference has been predominantly design-based. We develop a Bayesian framework for cluster sampling and account for the design effect in the outcome modeling. We consider a two-stage cluster sampling design where the clusters are first selected with probability proportional to cluster size, and then units are randomly sampled ...
متن کاملChanging the Probability versus Changing the Reward
There are two means of changing the expected value of a risk: changing the probability of a reward or changing the reward. Theoretically, the former produces a greater change in expected utility for risk averse agents. This paper uses two formats of a risk preference elicitation mechanism under two decision frames to test this hypothesis. After controlling for decision error, probability weight...
متن کاملProbability Generating Functions for Sattolo’s Algorithm
In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. Recently, H. Prodinger analysed two important random variables associated with the algorithm, and found their mean and variance. H. Mahmoud extended Prodinger’s analysis by finding limit laws for the same two random variables.The present article, starting from the ...
متن کاملGeometrical Probability Covering Algorithm
In this paper, we propose a novel classification algorithm, called geometrical probability covering (GPC) algorithm, to improve classification ability. On the basis of geometrical properties of data, the proposed algorithm first forms extended prototypes through computing means of any two prototypes in the same class. Then Gaussian kernel is employed for covering the geometrical structure of da...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics A: Mathematical and Theoretical
سال: 2020
ISSN: 1751-8113,1751-8121
DOI: 10.1088/1751-8121/abc72c